Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
نویسنده
چکیده
Amazons is a young board game with simple rules and a high branching factor, which makes it a suitable test-bed for planning research. This paper considers the computational complexity of amazons puzzles and restricted amazons endgames. We rst prove the NP{ completeness of the Hamilton circuit problem for cubic subgraphs of the integer grid. This result is then used to show that solving amazons puzzles is a NP-complete task and determining the winner of simple amazons endgames is NP-equivalent.
منابع مشابه
Generalized Amazons is PSPACE-Complete
Amazons is a perfect information board game with simple rules and large branching factors. Two players alternately move chess queen-like pieces and block squares on a 10×10 playing field. The player who makes the last move wins. Amazons endgames usually decompose into independent subgames. Therefore, the game is a natural testbed for combinatorial game theory. It was known that determining the ...
متن کاملAmazons is PSPACE-complete
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [2] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. We settle this problem, by showing that deciding the outcome of an n×n Amazon...
متن کاملPlaying Amazons Endgames
The game of the Amazons is a fairly young member of the class of territory-games. Since there is very few human play, it is difficult to estimate the level of current programs. However, it is believed that humans could play much stronger than todays programs, given enough training and incentives. With the more general goal of improving the playing level of Amazons programs in mind, we focused h...
متن کاملAmazons, Konane, and Cross Purposes are PSPACE-complete
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [3] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. Konane is an ancient Hawaiian game, with moves similar to peg solitaire. Kona...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کامل